Localized and compact data-structure for comparability graphs
نویسندگان
چکیده
منابع مشابه
Localized and Compact Data-Structure for Comparability Graphs
We show that every comparability graph of any two-dimensional poset over n elements (a.k.a. permutation graph) can be preprocessed in O(n) time, if two linear extensions of the poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The data-structure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bi...
متن کاملA Compact Data Structure and Parallel Algorithms for Permutation Graphs
Jens Gustedt, Michel Morvan, Laurent Viennot. A compact data structure and parallel algorithms for permutation graphs. M. Nagl. 21st Workshop on Graph-Theoretic Concepts in computer Science (WG), 1995, Aachen, Germany. Springer Berlin / Heidelberg, 1017, pp.372380, 1995, Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science. <http://www.springerlink.com/content/f161001...
متن کاملComparability graphs and intersection graphs
A function diagram (f-diagram) D consists of the family of curves {i, . . . , ii} obtained from n continuous functions fi : [O, 1] -B R (1 G i d n). We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement 0 is a comparability graph. An f-diagram generalizes the notion cf a permutation diagram where the fi are linear ...
متن کاملComparability Graphs and Molecular Properties :
The development of a recently proposed method for calculating molecular properties is outlined. The approach is based on the idea of constructing optimized compound samples for structure-property or structure-activity correlations by means of the so-cailed comparability graphs (CG) of isomeric compounds. A dynamic comparability principle is devised, proceeding from a series of standard molecula...
متن کاملPartitioned Probe Comparability Graphs
Given a class of graphs G, a graphG is a probe graph of G if its vertices can be partitioned into a set of probes and an independent set of nonprobes such that G can be embedded into a graph of G by adding edges between certain nonprobes. If the partition of the vertices is part of the input, we call G a partitioned probe graph of G. In this paper we show that there exists a polynomial-time alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.091